Method and/or system for transmitting and/or receiving data

ABSTRACT

Embodiments of a method and/or system of transmitting and/or receiving data is disclosed.

This disclosure claims priority pursuant to 35 USC 119(e) from U.S.provisional patent application serial no. Not Yet Assigned, filed onNov. 30, 2004, by LeTourneau, et al., titled, “METHOD AND/OR SYSTEM FORTRANSMITTING AND/OR RECEIVING DATA,” assigned to the assignee of thepresently claimed subject matter.

BACKGROUND

This disclosure is related to transmitting data and/or receiving data.

A variety of techniques exist for transmitting and/or receiving data.However, such techniques typically have several disadvantages,including, a limit on the size of the datum that may be transmittedand/or received, such as 32 or 64 bits, for example. Anotherdisadvantage includes the difficulty of synchronization between areceiver and transmitter. Thus, new methods and/or systems for receivingand/or transmitting data continue to be desirable.

BRIEF DESCRIPTION OF THE DRAWINGS

Subject matter is particularly pointed out and distinctly claimed in theconcluding portion of the specification. The claimed subject matter,however, both as to organization and method of operation, together withobjects, features, and advantages thereof, may best be understood byreference of the following detailed description when read with theaccompanying drawings in which:

FIG. 1 is a schematic diagram of an embodiment of a tree;

FIG. 2 is a schematic diagram illustrating an embodiment of anassociation between natural numerals and binary edge labeled trees;

FIG. 3 is a schematic diagram illustrating an embodiment of an operationapplied to an embodiment of two binary edge labeled trees;

FIG. 4 is a table illustrating an embodiment of operations in whichnatural numerals are associated with an embodiment of a sequence ofbinary values;

FIG. 5 is a table illustrating an application of the embodiment of FIG.4 to a series of natural numerals;

FIG. 6 is a table illustrating an embodiment of an operation thatassociates non-composite natural numerals with natural numerals;

FIG. 7 is a schematic diagram illustrating an embodiment of a techniquefor transmitting natural numerals using binary sequences; and

FIG. 8 is a table illustrating an embodiment of a technique forevaluating binary sequences received, such as those received via theapproach illustrated in FIG. 7.

DETAILED DESCRIPTION

In the following detailed description, numerous specific details are setforth to provide a thorough understanding of the claimed subject matter.However, it will be understood by those skilled in the art that theclaimed subject matter may be practiced without these specific details.In other instances, well-known methods, procedures, components and/orcircuits have not been described in detail so as not to obscure theclaimed subject matter.

Some portions of the detailed description which follow are presented interms of algorithms and/or symbolic representations of operations ondata bits or binary digital signals stored within a computing system,such as within a computer or computing system memory. These algorithmicdescriptions and/or representations are the techniques used by those ofordinary skill in the data processing arts to convey the substance oftheir work to others skilled in the art. An algorithm is here, andgenerally, considered to be a self-consistent sequence of operationsand/or similar processing leading to a desired result. The operationsand/or processing involve physical manipulations of physical quantities.Typically, although not necessarily, these quantities may take the formof electrical and/or magnetic signals capable of being stored,transferred, combined, compared and/or otherwise manipulated. It hasproven convenient, at times, principally for reasons of common usage, torefer to these signals as bits, data, values, elements, symbols,characters, terms, numbers, numerals and/or the like. It should beunderstood, however, that all of these and similar terms are to beassociated with the appropriate physical quantities and are merelyconvenient labels. Unless specifically stated otherwise, as apparentfrom the following discussion, it is appreciated that throughout thisspecification discussions utilizing terms such as “processing”,“computing”, “calculating”, “determining” and/or the like refer to theactions and/or processes of a computing platform, such as a computer ora similar electronic computing device, that manipulates and/ortransforms data represented as physical electronic and/or magneticquantities and/or other physical quantities within the computingplatform's processors, memories, registers, and/or other informationstorage, transmission, and/or display devices.

In a variety of fields, it is convenient and/or desirable to representdata, a set of data and/or other information in a hierarchical fashion.In this context, such a hierarchy of data shall be referred to as a“tree.” In a particular embodiment, a tree may comprise a finite,rooted, connected, acyclic graph. Likewise, such trees may be eitherordered or unordered. Here, ordered refers to the notion that there isan ordering or precedence among nodes attached to a common nodecorresponding to the order of the attached nodes shown in a graphicalillustration. An unordered tree is illustrated here, for example, inFIG. 1 by embodiment 100. As illustrated, the root of this particularembodiment encompasses node 105. In addition to 105, there are eightother nodes designated 110 to 145, respectively. Likewise, the nodes areconnected by branches referred to, in this context, as edges. Thus, thenodes of this tree are connected by eight edges. This embodiment,therefore, illustrates a finite tree that is rooted by node 105.Furthermore, the nodes are connected, meaning, in this context, that apath exists between any two nodes of the tree. The tree is likewiseacyclic, meaning here, that no path in the tree forms a complete loop.

In a variety of contexts, it may be convenient and/or desirable torepresent a hierarchy of data and/or other information using astructure, such as the embodiment illustrated in FIG. 1. One particularembodiment, without loss of generality, of a tree may include edges thatare labeled with data and/or other values. Likewise, in one particularembodiment, such data and/or values may be limited to a particular setof data. For example, in this context, a binary edge labeled tree refersto a tree in which the data and/or values comprise binary data, that is,in this example, either a binary one or a binary zero. Likewise,alternatively, the edges of a tree may be labeled with one value, orthree values. Continuing, the edges may be labeled with four values,five values, etc. In this context, the class of all trees in which theedges are labeled with a specific number of distinct values, that is, inthis context, values chosen from a set having a specific number ofdistinct elements, shall be referred to as edge-labeled trees (ELTs). Itis likewise noted that such trees are not limited to being labeled withnumerals, such as binary numerals as previously described. Anydistinctly identifiable labels may be employed; however, in thiscontext, it shall be understood that employing numerals to label theedges is sufficiently general to encompass any sort of data labels thatmay be desirable, regardless of their form. For example, and withoutloss of generality, a table look-up process may be employed to convertbetween a set of data or other labels and a set of natural numerals.

To reiterate, in this context, a tree comprises an edge labeled tree ifeach edge of the string or tree respectively stores a value or singlepiece of data. Likewise, in this context, two nodes are employed tosupport an edge holding a single piece of data. At this point, it isworth noting that trees having nodes and edges, such as previouslydescribed, may be represented in a computing platform or similarcomputing device through a data structure or a similar mechanismintended to capture the hierarchical relationship of the data, forexample. It is intended that all such embodiments are included withinthe scope of the claimed subject matter.

It is noted that binary edge labeled trees (BELTs) may be listed orenumerated. See, for example, U.S. provisional patent application Ser.No. 60/543,371, titled “Manipulating Sets of Hierarchical Data,” filedon Feb. 9, 2004, by J. J. LeTourneau, and assigned to the assignee ofthe current provisional application. This is illustrated, here, forexample, in FIG. 2. It is noted that this particular figure alsoincludes the associated natural numerals. The association of suchnumerals for this particular embodiment should be clear based at leastin part on previously cited U.S. provisional patent application Ser. No.60/543,371. However, it is, of course, again noted that the claimedsubject matter is not limited in scope to employing the approach orapproaches described in aforementioned U.S. provisional patentapplication Ser. No. 60/543,371. U.S. provisional patent applicationSer. No. 60/543,371 is provided simply as an example of listing orenumerating unordered BELTs.

However, for this particular embodiment, although the claimed subjectmatter is not limited in scope in this respect, a method of enumeratinga set of unordered trees may begin with enumeration of an empty binaryedge labeled tree and a one node binary edge labeled tree. Thus, theempty tree is associated with the natural numeral zero and has asymbolic representation as illustrated in FIG. 2 (circle). Likewise, theone node tree, which holds no data, is associated with the naturalnumeral one and has a graphical representation of a single node. Forhigher positive natural numbers, ordered trees may be generated by aprocess described, for example, in “The Lexicographic Generation ofOrdered Trees,” by S. Zaks, The Journal of Theoretical Computer Science,Vol. 10(1), pp 63-82, 1980, or, “Enumerating Ordered TreesLexicographically,” by M. C. Er, Computation Journal, Vol. 28, Issue 5,pp 538-542, 1985. This may be illustrated, for example in FIG. 2, asdescribed in more detail below.

As illustrated, for this particular embodiment, and as previouslydescribed, the empty tree has zero nodes and is associated with thenatural numeral zero. Likewise, the one node tree root comprises asingle node and is associated with the natural numeral one. Thus, toobtain the tree at position two, a root node is attached and connectedto the prior root node by an edge. Likewise, here, by convention, theedge is labeled with a binary zero. If, however, the tree formed by theimmediately proceeding approach were present in the prior enumeration oftrees, then a similar process embodiment is followed, but, instead, thenew edge is labeled with a binary one rather than a binary zero. Thus,for example, to obtain the binary edge labeled tree for position three,a new root node is connected to the root node by an edge and that edgeis labeled with a binary one.

Continuing with this example, to obtain the binary edge labeled tree forposition four, observe that numeral four is the product of numeral twotimes numeral two. Thus, a union is formed at the root of two trees,where, here, each of those trees is associated with the positive naturalnumeral two. Likewise, to obtain the binary edge labeled tree forposition five, begin with the binary edge labeled tree for position twoand follow the previously articulated approach of adding a root and anedge and labeling it with a binary zero.

In this context, adding a root node and an edge and labeling it binaryzero is referred to as a “zero-push” operation and adding a root nodeand an edge and labeling it binary one is referred to as a “one-push”operation. Thus, referring again to FIG. 2, the one-push of the roottree is the tree at position three. This follows from FIG. 9 ofpreviously referenced U.S. provisional patent application Ser. No.60/543,371, since Q((1*2)−1)=Q(1)=3. Likewise, the tree at position fiveis the zero-push of the tree at position 2. Again, this follows fromFIG. 9 of the previously referenced US provisional patent application,since Q((2*2)−2)=Q(2)=5.

In the embodiment just described, binary edge labeled trees use binarynumerals “0” and “1.” However, as previously suggested, the claimedsubject matter is not limited in scope to binary edge labeled trees. Forexample, trees may employ any finite number of numeral combinations aslabels, such as a unitary value, triplets, quadruplets, etc. Thus, usinga quadruplet example, it is possible to construct trees, such as azero-push of a particular tree, a one-push of that tree, a two-push ofthat tree, and a three-push of that tree. Thus, for such trees, edgesmay be labeled 0, 1, 2 or 3, etc., for example.

The foregoing discussion has begun to characterize an algebra involvingtrees, in this particular embodiment, an algebra for unordered edgelabeled trees or unordered ELTs, such as BELTs. The foregoing discussiondefines a value zero, a zero node tree for this particular embodiment, avalue one, a one node tree for this particular embodiment, and monadicoperations, previously described as a zero-push and a one-push. For thisparticular embodiment, an additional operation may be characterized, a“merger” operation. The merger operation with respect to trees refers tomerging two trees at their roots. This operation is illustrated, forexample, in FIG. 3.

As will now be appreciated, the merger operation comprises a binaryoperator. Likewise, the constants zero/one, referred to above, may beviewed as an operation having no argument or as a zero valued argumentoperator or operation. Thus, this operation, in effect, returns the samevalue whenever applied. Here, for this particular embodiment, theconstant value, or zero valued argument operation returns “c” and isdenoted as “c.” The merger operator is denoted as “*” and here comprisesa binary operation. In contrast, in U.S. provisional patent applicationNo. 60/575,784, titled “Method and/or System for Simplifying TreeExpressions, such as for Pattern Matching,” filed May 28, 2004, by J. J.LeTourneau, assigned to the assignee of the current application, monadicoperators were employed, referred to as successor operators, using thesymbol S(x), much like the push operations previously described.

Previously, an embodiment for manipulating binary edge labeled trees orBELTs was described in connection with U.S. provisional patentapplication 60/543,371. In that context, binary edge labeled treescomprise finite rooted, unordered two valued edge labeled trees. Thus,for the particular embodiment of binary edge labeled trees described,the two values comprise “0” and “1,” although alternately they couldcomprise A and B, for example, or any other two values. Likewise,previously, in U.S. provisional application 60/543,371, an embodimentwas demonstrated in which an association existed between naturalnumerals and binary edge labeled trees. For this particular embodiment,similar associations also exist, here between any N valued edge labeledtree and the natural numerals, where N is a numeral. Of course, manydifferent associations are possible and the claimed subject matter isintended to cover all such associations regardless of the particularembodiment. Thus, for example, three valued edge label trees may beconverted to numerals, four valued edge labeled trees may be convertedto numerals and so forth. Thus, manipulations, such as those previouslydescribed, for example, in aforementioned provisional U.S. patentapplication 60/543,371, as well as additional manipulations, may beapplied to N valued edge labeled trees, as described in more detailhereinafter. See, for example, U.S. provisional patent application Ser.No. 60/623,280, titled “METHOD AND/OR SYSTEM FOR MANIPULATING TREEEXPRESSIONS” filed on Oct. 29, 2004, by J. J. LeTourneau, and U.S.provisional patent application Ser. No. 60/623,352 titled “METHOD AND/ORSYSTEM FOR TAGGING TREES” filed on Oct. 29, 2004, by J. J. LeTourneau;both of the foregoing assigned to the assignee of the currentprovisional patent application.

As suggested in previously referenced U.S. provisional application60/543,371, in one particular embodiment, when converting between binaryedge labeled trees and numerals, a relationship was found to existbetween a “push” operation and non-composite numerals. Thus, in thiscontext, it may be convenient to define an operation indexed by thenatural numerals that provides in ascending order the non-compositenumerals, although, of course, the claimed subject matter is not limitedin scope in this respect. Such an operation is depicted specifically inFIG. 6. As described in more detail hereinafter, this operation is alsoconvenient in this context in connection with unitary edge labeledtrees.

As previously suggested in aforementioned U.S. provisional patentapplication No. 60/575,784, a set of congruence operations on a set oftree expressions may be isomorphic to a set of finite, rooted, unorderedbinary edge labeled trees. Thus, or more particularly, under such anisomorphism, in the particular embodiment, a one-to-one relationshipbetween the equivalence classes that satisfy the tree expressions andthe finite, rooted, ordered binary edge labeled trees may exist.

It is likewise noted that, for this particular embodiment, one way ofmanipulating an edge labeled tree is to apply a push operation to theedge labeled tree. Likewise, as previously described, for thisembodiment, a push operation comprises adding an edge and labeling it.For this embodiment, the labels for the edge labeled tree comprisenumerals. Of course, this is merely one potential embodiment and theclaimed subject matter is not limited in scope in this respect. Forexample, as previously described, letters may be employed. Likewise, anyset of values where each value is distinct may be employed and remainwithin the scope of the claimed subject matter. Furthermore, a similarset of manipulations may be applied to node labeled trees rather thanedge labeled trees. Likewise, a push operation may be applied to a nodelabeled tree, as previously described for edge labeled trees.

Additional uses of the previously described embodiment also exist,although the claimed subject matter is not limited in scope to aparticular embodiment. For example, in one embodiment, FIG. 5 providesan embodiment of an association between natural numerals, on theleft-hand side of FIG. 5, and a set of binary-valued strings or binarysequences, on the right-hand side of FIG. 5. Of course, as has beenpreviously indicated, the claimed subject matter is not limited in scopeto this particular association embodiment and many other associationembodiments are included within the scope of the claimed subject matter.Nonetheless, there are aspects of this particular embodiment worthy offurther discussion. For example, FIG. 4 provides a set of rules thatpermit conversion between the natural numerals and this particularassociation embodiment of sequences. Again, it is noted that the claimedsubject matter is not limited in scope to this particular embodiment.However, as shall be discussed in more detail hereinafter, a feature ofthis particular embodiment is the ability to represent push operationsand merger operations, such as those previously described in connectionwith edge labeled trees, using strings or sequences, here binary-valuedstrings or sequences.

FIG. 4 provides for this embodiment a set of rules for convertingnatural numerals to binary-valued strings. In this context, for FIGS. 4and 5, a numeral with brackets, such as [X], is intended here to denotethe binary sequence for X. As illustrated, and as is similar to theapproach previously employed in conjunction with edge labeled trees, thenumeral 0 is assigned an empty string, whereas the numeral 1 is assigneda pair of corresponding left-right brackets or parentheses (It is notedthat the terms brackets and parentheses used interchangeably). This isindicated by expression 410. It is likewise noted that, in this context,the numeral zero is included when referring to the natural numerals.Likewise, as is illustrated by expression 420 in FIG. 4, a non-zeronumeral that is two times the numeral X is represented as the string orsequence for X plus an extra set of left-right brackets or parenthesesin front of the string or sequence for the numeral X. Likewise,expression 430, denoted the odd non-composite rule, is similar inconcept to a push operation, previously described in connection withedge labeled trees. If a natural numeral is a non-composite numeral, itis assigned the string or sequence for the natural number index of thatnon-composite, as defined by the operation shown in FIG. 6, but thensurrounded by an additional left-hand bracket on the left-hand side andan additional right hand bracket on the right-hand side, as depicted inFIG. 4. Further, expression 440 comprises the merger rule in which themultiplication of two natural numerals is simply the combination of thestrings or sequences for those natural numerals represented side by sideor adjacent to one another. It is further noted, although the claimedsubject matter is not limited in scope in this respect, that aconvention may be introduced to ensure that a unique association existsbetween particular numerals and strings. For example, one suchconvention may be that the smaller of the two numerals is the string orsequence on the left, for example, although, the claimed subject matteris not limited in scope to such a particular approach. From these rules,it is possible to construct the binary-valued sequences shown in FIG. 5that correspond with the natural numerals. Again, it is noted that thisis a particular association embodiment and the claimed subject matter isnot limited in scope in this respect. Thus any one of a number of otherrules for constructing sequences might have been employed and remainwithin the scope of the claimed subject matter.

A feature of this embodiment, although the claimed subject matter is notlimited in scope in this respect, is that the binary-valued sequencesshown in FIG. 5 may likewise be associated with unitary edge labeledtrees, that is, trees that employ a single unitary label for all of theedges of the tree. To be more specific, the set of distinct values fromwhich labels for edges are chosen is a set of one value only in such anembodiment. Alternatively, such trees need not have their edges labeledwith any value since in such an embodiment the value is the same for alledges. Here, such an edge labeled tree may be converted to, for example,for this particular embodiment, a binary-valued string corresponding theedge labeled tree and the string may be manipulated in place ofmanipulating a corresponding natural numeral.

Thus, this particular embodiment provides an approach in which unitaryedge labeled trees may be manipulated by converting to natural numerals,manipulating the natural numerals, and converting back to unitary edgelabeled trees. See, for example, U.S. provisional patent applicationSer. No. 60/623,280 titled “METHOD AND/OR SYSTEM FOR MANIPULATING TREEEXPRESSIONS filed on Oct. 29, 2004, by J. J. LeTourneau, and U.S.provisional patent application Ser. No. 60/623,352, titled “METHODAND/OR SYSTEM FOR TAGGING TREES filed on Oct. 29, 2004, by J. J.LeTourneau; both of the foregoing assigned to the assignee of thecurrent provisional patent application. Furthermore, unitary edgelabeled trees may be manipulated by converting to correspondingbinary-valued strings, manipulating the strings, and then convertingback to unitary edge labeled trees. It is noted that the claimed subjectmatter is not limited to these particular approaches or to employing anyone of these approaches alone. The desirability of the approach willvary with a variety of potential factors, including storagecapabilities, processing capabilities, the particular application andthe like.

In yet another embodiment in accordance with the claimed subject matter,a sequence of natural numerals may be converted to a binary sequencerepresenting trees of finite size, such as unitary trees. As shall bediscussed in more detail hereinafter, additionally padding values may beimbedded or added between the portion of the sequence that representsnatural numerals, also referred to as data or signal information in thisparticular context. The resulting sequence may then be transmitted.Likewise, the binary sequence representing natural numerals in the formof finite trees plus padding values may be received and then convertedinto the sequence of natural numerals at the receiving end.

Thus, although the claimed subject matter is not limited in scope inthis respect, this particular embodiment provides a technique fortransmitting a finite sequence of natural numerals by employing twovalues, referred to in this context as a binary sequence or abinary-valued string. It is noted that these values may comprise “0” and“1” as is conventionally employed in connection with digital systems,although, of course, the claimed subject matter is not limited in scopein this respect. Instead, for this particular embodiment, and asillustrated in connection with FIG. 4, “0” shall comprise a leftparenthesis, denoted “(”, and “1” shall comprise a right parenthesis,denoted “)”, for this particular embodiment. Nonetheless, as isunderstood, there is no loss of generality by employing this valuereplacement for the purposes of this particular embodiment.

FIG. 7 is a schematic diagram illustrating an example of this particularembodiment. Thus, as illustrated, a finite sequence of natural numerals,designated for example as 1, 2, . . . , 1, 0 are translated, depictedhere by box 710 in FIG. 7. This translation may be implemented using atable look up, for example, applying the approach previously describedwith respect FIGS. 4 and 5. Alternatively, of course, instead, thepreviously described approach may be implemented by a computing platformprogrammed to determine the desired binary sequence representation for anatural numeral, computed, for example, as previously described, from afinite tree, such as a unitary tree for this particular embodiment.

Although the claimed subject matter is not limited in scope in thisrespect, as suggested, one technique for implementing this approach maybe to apply a table look up approach. Techniques for performing tablelook-ups are well-known and well-understood. Thus, this will not bediscussed in detail here. However, it shall be appreciated that any andall of the previously described and/or later described processing,operations, conversions, transformations, manipulations, etc. ofstrings, trees, numerals, data, etc. may be performed on one or morecomputing platforms or similar computing devices, such as those that mayinclude a memory to store a table as just described, although, theclaimed subject matter is not necessarily limited in scope to thisparticular approach. Thus, for example, a hierarchy of data, such as atree as previously described, for example, may be formed. Likewise,operations and/or manipulations, as described, may be performed;however, operations and/or manipulations in addition to those describedor instead of those described may also be applied. It is intended thatthe claimed subject matter cover all such embodiments.

Additionally, padding values may be imbedded or inserted betweenrepresentations of the particular natural numerals, here, the particularbinary representations for the particular trees. In this particularembodiment, such a padding value comprises a left parenthesis, although,of course, the claimed subject matter is not limited in scope in thisrespect. It is noted that, for this embodiment, an arbitrary amount ofpadding may be inserted between the representations of the naturalnumerals to be transmitted. As discussed in more detail, this is onedesirable aspect of this particular embodiment. Although the claimedsubject matter is not limited in scope in this respect, such padding maybe inserted between such representations, as depicted by process box 720in FIG. 7. It is this combined binary sequence that then may betransmitted across a transmission media or communications channel. Thisbinary sequence may then be received at a receiver which may then beemployed, as depicted by box 730, to convert the binary sequence backinto the natural numerals, as described in more detail below, for thisparticular embodiment.

It is noted that this particular embodiment has a number of desirableproperties associated with it. For example, natural numerals may betransmitted in any multiplicity and in any order. Likewise, although theprevious discussion suggests the communication of natural numerals, inan alternate embodiment, a table look up may be employed at each end ofa communications channel to permit communication of other informationother than natural numerals. For example, natural numerals may representother information to be communicated and a table look up process at thereceiving end and transmitting end may be employed to perform theconversion prior to transmission and after reception. Likewise, in FIG.7, the particular binary sequence is illustrated as being applied toprocess box 720 in reverse order, so that the sequence is “read” rightto left here, although this is merely one embodiment and, alternatively,the binary sequence may be applied to process box 720 without employingthis reverse order.

As previously indicated, in this particular embodiment, rightparenthesis or right bracket and left parenthesis or left bracket inplace of the conventional binary values “0” and “1’; however, theclaimed subject matter is not limited in this respect. Likewise, for theembodiment illustrated in FIG. 7, as illustrated and discussed in moredetail later, a sequence of values is read right to left, although, ofcourse, the claimed subject matter is not limited in scope in thisrespect. Thus, on the receiver side of the communications channel, if aright parenthesis is received, this indicates the start of a sequence ofdata or signal information. Alternatively, if a left parenthesis isreceived this indicates padding unless a right parenthesis is receivedfirst that corresponds to the left parenthesis. One way to implementthis, although, of course, the claimed subject matter is not limited inscope in this respect, is by assigning a minus one (−1) to a leftparenthesis or bracket and a plus one (+1) to a right parenthesis orbracket. Thus, by accumulating values as parentheses are received,encountering zero may be employed to indicate or synchronize thebeginning of a binary sequence of data. This approach has a number ofpotential advantages, although the claimed subject matter is not limitedin scope to this approach or to possessing the particular advantages ofa particular embodiment.

An effect of this accumulation approach is to match binary values inthis particular embodiment, such as matching a left parenthesis with acorresponding right parenthesis. Once the accumulation equals zero, thereceiver recognizes that it has received signal information, in thisparticular embodiment, a binary sequence representing a natural numeral.In this context, the term signal information generally refers to data tobe transmitted across a communications channel. Thus, a first rightparenthesis is a wake up signal to the receiver and a corresponding leftparenthesis signals the end of a grouping of signal information.Likewise, if zero is reached again, this allows the receiver torecognize that signal information has been communicated. Otherwise, whatis received represents padding values that may be inserted betweengroupings of signal information. Of course, for this embodiment, theparticular groupings represent particular natural numerals. Likewise,with this mechanism, referring to FIG. 5, if nothing, that is, noadditional values, is received between corresponding binary values, suchas left and right parenthesis, this signifies the natural numeral zeroin this embodiment using the empty sequence of empty string.Alternately, the natural numeral one and the remaining natural numeralsmay be indicated by receiving a sequence of binary values or right andleft parentheses, such as those indicated in FIG. 5, between a first setof corresponding binary values, such as between a right and a leftparenthesis, although the claimed subject matter is not limited in scopein this respect. As the previous discussion in FIG. 5 indicates, aparticular grouping of signal information will not be completelyreceived until the accumulation at the receiver equals zero. This is asignal in this embodiment to the receiver that a grouping of binaryvalues that represents a discrete natural numeral has been receivedbetween a set of corresponding binary values, such as, for thisembodiment, a right parenthesis and a left parenthesis.

One technique, although the claimed subject matter is not limited inscope in this respect, to determine whether a portion of a binarysequence is padding or signal information is based at least in part onthe amount that has been accumulated at the time a particular binaryvalue is received. For example, using the convention previouslydescribed, if the accumulation is negative, that indicates data orsignal information is currently being received; however, if theaccumulation is positive, that indicates padding, such as, for oneembodiment, for example, control signal information, is currently beingreceived.

This particular technique or embodiment has a number of usefulproperties, although the claimed subject matter is not limited in scopeto this particular embodiment.

For example, a natural numeral of any particular size may be transmittedacross a communications channel. Thus, communication of a naturalnumeral is not limited by a buffer size or register size, such as 32bits or 64 bits. Likewise, similarly, arbitrarily-sized padding orbreaks may be employed between natural numerals. In addition, as theprevious discussion illustrates, for this particular embodiment, thebinary sequence is self-synchronizing. More specifically, the receiverbecomes synchronized whenever zero is reached during accumulation, aspreviously described. This provides an advantage over other types ofapproaches in which synchronizing signals are transmitted separatelyfrom the data.

It is likewise noted that the ability to provide arbitrary padding orbreaks between signal information provides a number of differentpotential capabilities, although the following examples are not intendedto limit the scope of the claimed subject matter in any way. Forexample, it may be possible to use padding between groupings of binaryvalues to communicate control signals, such as, in one example,potential multiplexing of the sequence signal information. In thisparticular context, the term control signals or control signalinformation refers to signal information that is not data to becommunicated, For example, the padding could designate differentprocessors or other hardware that are to receive and/or process aparticular portion of the binary sequences received. Likewise, ifseveral independent binary sequences are transmitted separately, theself-synchronizing capability previously described provides thecapability for the independent sequences to become cross-synchronized,even, for example, if received by different receivers. Likewise,alternately, such padding may provide other control signal information,such as encryption keys that may be employed in any one of a variety ofpossible encryptions schemes. Likewise, such padding values may beemployed for watermarking or authentication of received binarysequences. Again, these are just a few examples of possible uses of thepadding values in connection with a binary sequence as described in thisparticular embodiment. Alternately, such padding could provide “contextcontrol,” such as, for example, depending upon the particular context,using padding to provide control signal information designating orindicating the meaning of the data or signal information that is beingreceived. Perhaps, for example, without intending to limit the scope ofthe claim subject matter, each natural numeral, or at least some of thenatural numerals being transmitted, represents data for a differentpurpose at the receiving end of a communications channel. Likewise,depending on the particular environment, it may be possible to insertreal time information in place of padding values as binary sequences aretransmitted between different points or nodes, for example. This may beuseful, for example, if there are delays or other communication systemperformance information, for example, that it is desirable to capture inreal time in a string of communication transmissions, for example.Likewise, another application may include inserting error correctioncoding into the binary sequence so as not to disturb the data beingtransmitted.

In still yet another embodiment, content signal information may beprovided by padding values. Examples, without limitation include: audiosignal information, video signal information, picture signalinformation, VoIP encoding signal information, or other informationabout the content of the sequence.

In yet another embodiment, although, again, the claimed subject matteris not limited in scope in this respect, compression may be applied. Forexample, if natural numerals are to be transmitted, the particularnatural numbers may be factored into non-composite numerals and indicesfor the non-composite numerals, such as those indicated in FIG. 6, forexample, may be represented in the binary sequence, potentially reducingthe number of total binary values to be transmitted.

An aspect of this particular embodiment also relates to converting fromthe binary sequence acquired at the receiver to a sequence of naturalnumerals. Of course, for this particular embodiment, data or signalinformation and padding values are separated. Likewise padding valuesare then ignored at least for the purposes of determining the naturalnumerals that were transmitted. As previously described, one approachmay be to employ a look up table containing information, such as thatillustrated in FIG. 5. In an alternate embodiment, however, it may bepossible to, instead, determine the associated natural numeral with thereceived binary sequence through computation. This may be accomplished,for this particular embodiment, in a manner similar to an inverse of theapproach depicted in FIG. 4.

Once a grouping of sequence values representing a particular naturalnumeral, or representing a particular tree (that corresponds to aparticular natural numeral) is received, using the approach describedabove, for example, for this particular embodiment, that grouping isevaluated.

For example, as previously suggested for this particular embodiment, ifthe grouping is empty, this indicates the natural numeral 0. Here, ofcourse, this refers to receiving one set of corresponding binary valuesfor synchronization, such as a right and left parenthesis. However, if asingle right parenthesis and a single corresponding left parenthesis isbetween the one set of corresponding binary values providingsynchronization, here a corresponding right and left parenthesis, forthis particular embodiment, this indicates the natural numeral 1. If thegrouping contains anything else, in this embodiment, further evaluationis performed on the values between the corresponding right and leftparentheses, as described in more detail below.

Within or between the first set of corresponding right and leftparentheses is a subgrouping of values. If the subgrouping is not one ofthe possibilities discussed immediately above (e.g., empty or aright-left pair, for example), three other possibilities remain for thisparticular embodiment. First, there may be second set of correspondingright and left parentheses that contain a subgrouping of values. Second,there may be a second set of corresponding right and left parenthesesimmediately preceding a subgrouping of values. Third, there may be twoself-contained or complete subgroupings of binary values side-by-side.

These possibilities are depicted in FIG. 8. In this particular context,the term grouping refers to the longest sequence of consecutive binaryvalues out of a sequence that taken as a whole represents a singlenatural numeral. The term subgrouping refers to a sequential portion ofbinary values that is a subset of a grouping. It is noted that agrouping may contain subgroupings that represent natural numerals;likewise, a subgrouping may contain smaller subportions that alsorepresent a natural numeral. Thus, in a recursive fashion, the groupingand then the subgroupings are evaluated using the approach illustrated,for this embodiment, in FIG. 8, until a natural numeral is determinedfor a complete grouping.

Of course, the claimed subject matter is not limited to unordered edgelabeled trees. For example, as described in previously cited U.S.provisional patent application 60/543,371, binary edge labeled trees andbinary node labeled trees may be employed nearly interchangeably torepresent substantially the same hierarchy of data. In particular, abinary node labeled tree may be associated with a binary edge labeledtree where the nodes of the binary node labeled tree take the samevalues as the edges of the binary edge labeled tree, except that theroot node of the binary node labeled tree may comprise a node having azero value or a null value. Thus, rather than employing edge labeledtrees (ELTs), the previously described embodiments may alternatively beperformed using node labeled trees (NLTs). As one example embodiment,operations and/or manipulations may be employed using edge labeled treesand the resulting edge labeled tree may be converted to a node labeledtree. However, in another embodiment, operations and/or manipulationsmay be performed directly using node labeled trees.

In accordance with the claimed subject matter, therefore, any tree,regardless of whether it is edge labeled, node labeled, non-binary, afeature tree, or otherwise, may be manipulated and/or operated upon in amanner similar to the approach of the previously described embodiments.However, for convenience, without intending to limit the scope of theclaimed subject matter in any way, here, operations and/or manipulationsand the like have been described primarily in the context of unitarytrees. See, for example, U.S. provisional patent application Ser. No.60/543,371, titled “Manipulating Sets of Hierarchical Data,” filed onFeb. 9, 2004, by J. J. LeTourneau, and assigned to the assignee of thecurrent provisional application.

It will, of course, be understood that, although particular embodimentshave just been described, the claimed subject matter is not limited inscope to a particular embodiment or implementation. For example, oneembodiment may be in hardware, such as implemented to operate on adevice or combination of devices, for example, whereas anotherembodiment may be in software. Likewise, an embodiment may beimplemented in firmware, or as any combination of hardware, software,and/or firmware, for example. Likewise, although the claimed subjectmatter is not limited in scope in this respect, one embodiment maycomprise one or more articles, such as a storage medium or storagemedia. This storage media, such as, one or more CD-ROMs and/or disks,for example, may have stored thereon instructions, that when executed bya system, such as a computer system, computing platform, or othersystem, for example, may result in an embodiment of a method inaccordance with the claimed subject matter being executed, such as oneof the embodiments previously described, for example. As one potentialexample, a computing platform may include one or more processing unitsor processors, one or more input/output devices, such as a display, akeyboard and/or a mouse, and/or one or more memories, such as staticrandom access memory, dynamic random access memory, flash memory, and/ora hard drive. For example, a display may be employed to display one ormore queries, such as those that may be interrelated, and or one or moretree expressions, although, again, the claimed subject matter is notlimited in scope to this example.

In the preceding description, various aspects of the claimed subjectmatter have been described. For purposes of explanation, specificnumbers, systems and/or configurations were set forth to provide athorough understanding of the claimed subject matter. However, it shouldbe apparent to one skilled in the art having the benefit of thisdisclosure that the claimed subject matter may be practiced without thespecific details. In other instances, well-known features were omittedand/or simplified so as not to obscure the claimed subject matter. Whilecertain features have been illustrated and/or described herein, manymodifications, substitutions, changes and/or equivalents will now occurto those skilled in the art. It is, therefore, to be understood that theappended claims are intended to cover all such modifications and/orchanges as fall within the true spirit of the claimed subject matter.

1-100. (canceled)
 101. A method of executing computer instructions, themethod comprising: accessing instructions from one or more physicalmemory devices for execution by one or more processors; executing theinstructions accessed from the one or more physical memory devices bythe one or more processors; storing, in at least one of the physicalmemory devices, signal values resulting from having executed theinstructions on the one or more processors; wherein the accessedinstructions to communicate a sequence of binary values; and whereinexecuting the sequence communication instructions further comprising:receiving, via a communications channel, a sequence of binary values inthe form of digital electronic signals, the digital electronic signalscomprising content signals, the sequence comprising a sequence oflabeled tree structures in the form of the sequence of binary values andthe sequence of the labeled tree structures representing content,wherein the labeled tree structures comprise labeled tree hierarchies;and converting the labeled tree hierarchies to symbols, wherein thesequence of binary values further comprises a sequence to synchronizethe transmitting and receiving ends of the communications channel. 102.The method of claim 101, wherein the content signals comprise at leastone of the following content signals: audio content signals; videocontent signals; picture content signals; alphanumerical string contentsignals; or VoIP content signals.
 103. The method of claim 101, whereinthe converting the labeled tree hierarchies to symbols comprisesaccessing the one or more of the physical memory devices to identify thesymbols associated with the labeled tree hierarchies, the one or morephysical memory devices storing an accessible structure comprisingstored values representing the symbols.
 104. The method of claim 103,wherein the accessing the one or more physical memory devices toidentify the symbols associated with the labeled tree hierarchiescomprises performing a table look up operation to determine the symbolsassociated with the labeled tree hierarchies
 105. The method of claim101, further comprising: comparing a symbol representing a labeled treehierarchy to other symbols stored in the one or more physical memorydevices to detect a presence of the symbol, wherein a correspondencebetween the symbol and at least one of the other symbols is indicativeof a presence of content in electronic content corresponding to the atleast one of the other symbols stored and is indicative of one or morelocations thereof.
 106. The method of claim 101, the sequence furthercomprising control signals.
 107. The method of claim 101, the sequencefurther comprising padding signals.
 108. The method of claim 101,wherein the sequence comprises a self-synchronizing sequence.
 109. Themethod of claim 101, wherein the sequence comprises across-synchronizing sequence.
 110. An article comprising: anon-transitory storage medium comprising instructions stored thereon:wherein the instructions being accessible from the non-transitorystorage medium as physical memory states on one or more physical memorydevices, the one or more physical memory devices coupled to one or moreprocessors able to execute the instructions stored as physical memorystates, the one or more physical memory devices also able to storebinary digital signal quantities, if any, as physical memory states,that are to result from execution of the instructions on the one or moreprocessors, wherein the executable instructions to communicate asequence of binary values, and wherein the sequence communicationinstructions further to: communicate, via a communications channel, asequence of binary values in the form of digital electronic signals, thedigital electronic signals comprising content signals, the sequence tocomprise a sequence of labeled tree structures in the form of thesequence of binary values and the sequence of the labeled treestructures to represent content, wherein the labeled tree structures tocomprise the labeled tree hierarchies and the sequence to furthercomprise a sequence to synchronize the transmitting and receiving endsof the communications channel; and convert the labeled tree hierarchiesto symbols, wherein the sequence of binary values further comprises asequence to synchronize the transmitting and receiving ends of thecommunications channel.
 111. The article of claim 110, wherein thecontent signals to comprise at least one of the following contentsignals: audio content signals; video content signals; picture contentsignals; alphanumerical string content signals or VoIP encoding contentsignals.
 112. The article of claim 110, wherein to convert the labeledtree hierarchies to symbols comprises to access the physical memorydevices to identify the symbols associated with the labeled treehierarchies, the one or more physical memory devices to store anaccessible structure comprising stored values representing the symbols.113. The article of claim 112, wherein the accessing the one or morephysical memory devices to identify the symbols associated with the treehierarchies comprises to perform a table look up operation to determinethe symbols associated with the labeled tree hierarchies.
 114. Thearticle of claim 110, wherein the sequence communication instructionsfurther to compare a symbol representing a labeled tree hierarchy toother symbols in the one or more physical memory devices to detect apresence of the symbol, wherein a correspondence between the symbol andat least one of the other symbols is indicative of a presence of contentin electronic content corresponding to the at least one of the othersymbols and is indicative of one or more locations thereof.
 115. Thearticle of claim 110, the sequence to further comprise control signals.116. The article of claim 110, the sequence to further comprise paddingsignals.
 117. The article of claim 110, wherein the sequence to furthercomprise a self-synchronizing sequence.
 118. The article of claim 110,wherein the sequence to further comprise a cross-synchronizing sequence.119. An apparatus comprising: one or more processors coupled to one ormore physical memory devices to store executable instructions and tostore binary digital storage quantities as physical memory states,wherein the executable instructions being accessible from the one ormore physical memory devices for execution by one or more processors;and the one or more processors able to store in at least one of thephysical memory devices, binary digital signal quantities, if any, thatare to result from execution of the instructions on the one or moreprocessors, wherein the accessed executable instructions to communicatea sequence of binary values; and wherein the sequence communicationinstructions further to: communicate, via a communications channel, asequence of binary values in the form of digital electronic signals, thedigital electronic signals to comprise content signals; the sequence tocomprise a sequence of labeled tree structures in the form of thesequence of binary values and the sequence of the labeled treestructures to represent content, wherein the labeled tree structures tocomprise labeled tree hierarchies; and convert the labeled treehierarchies to symbols, wherein the sequence of binary values further tocomprise a sequence to synchronize the transmitting and receiving endsof the communications channel.
 120. The apparatus of claim 119, whereinthe content signals comprise at least one of the following contentsignals: audio content signals; video content signals; picture contentsignals; alphanumerical string content signals; or VoIP encoding contentsignals.
 121. The apparatus of claim 119, wherein the symbols to convertthe labeled tree hierarchies to symbols to comprise to access the one ormore physical memory devices to identify the symbols associated with thelabeled tree hierarchies.
 122. The apparatus of claim 121, wherein toaccess the one or more physical memory devices to identify the symbolsassociated with the labeled tree hierarchies to comprise to perform atable lookup operation to determine the symbols associated with thelabeled tree hierarchies.
 123. The apparatus of claim 119, further tocomprise to compare a symbol to represent a labeled tree hierarchy toother symbols stored in the one or more physical memory devices todetect a presence of the symbol, wherein a correspondence between thesymbol and at least one of the other symbols is indicative of a presenceof content in electronic content corresponding to at least one of theother symbols stored and is indicative of one or more locations thereof.124. The apparatus of claim 119, wherein the sequence to comprise aself-synchronizing sequence.
 125. The apparatus of claim 119, whereinthe sequence to comprise a cross-synchronizing sequence.
 126. Theapparatus of claim 119, wherein the sequence of binary values further tocomprise control signals.
 127. The apparatus of claim 119, wherein thesequence of binary values further to comprise padding signals.
 128. Anapparatus to communicate a sequence of binary values to represent asequence of finite labeled trees, the apparatus comprising: means foraccessing instructions from one or more physical memory devices forexecution by one or more processors; means for executing theinstructions accessed from the one or more physical memory devices bythe one or more processors; means for storing, in at least one of thephysical memory devices, signal values resulting from having executedthe instructions on the one or more processors; wherein the accessedinstructions to communicate a sequence of binary values; and wherein themeans for executing the sequence communication instructions comprises:means for communicating via a communications channel a sequence ofbinary values in the form of digital electronic signals, the digitalelectronic signals comprising content signals; the sequence comprising asequence of labeled tree structures in the form of the sequence ofbinary values and the sequence of the finite labeled tree structuresrepresenting content, wherein the labeled tree structures comprisinglabeled tree hierarchies; and means for converting the labeled treehierarchies to symbols, wherein the sequence of binary values furthercomprises a sequence to synchronize the transmitting and receiving endsof the communications channel.
 129. The apparatus of claim 128, whereinthe content signals comprise at least one of the following contentsignals: audio content signals; video content signals; picture contentsignals; alphanumerical string content signals; or VoIP encoding contentsignals.
 130. The apparatus of claim 128, wherein the sequence comprisesa self-synchronizing sequence.
 131. The apparatus of claim 128, whereinthe sequence comprises a cross-synchronizing sequence.
 132. Theapparatus of claim 128, wherein the means for converting the labeledtree hierarchies comprises means for accessing the one of the physicalmemory devices to identify the symbols associated with the labeled treehierarchies.
 133. The apparatus of claim 132, wherein the means foraccessing the one or more physical memory devices to identify thesymbols associated with the labeled tree hierarchies comprises a meansfor performing a table look up operation to determine the symbolsassociated with the labeled tree hierarchies.
 134. The apparatus ofclaim 128, further comprising a means for comparing a symbolrepresenting a labeled tree hierarchy to other symbols stored in the oneor more physical memory devices to detect a presence of the symbol,wherein a correspondence between the symbol and at least one of theother symbols is indicative of a presence of content in electroniccontent corresponding to the at least one of the other symbols storedand is indicative of one or more locations thereof.
 135. The apparatusof claim 128, the sequence further comprising control signals.
 136. Theapparatus of claim 128, the sequence further comprising padding signals.